On the stabbing number of a random Delaunay triangulation
نویسندگان
چکیده
منابع مشابه
On the stabbing number of a random Delaunay triangulation
We consider a Delaunay triangulation defined on n points distributed independently and uniformly on a planar compact convex set of positive volume. Let the stabbing number be the maximal number of intersections between a line and edges of the triangulation. We show that the stabbing number Sn is Θ( √ n) in the mean, and provide tail bounds for P{Sn ≥ t √ n}. Applications to planar point locatio...
متن کاملEfficiently navigating a random Delaunay triangulation
Planar graph navigation is an important problem with significant implications to both point location in geometric data structures and routing in networks. However, whilst a number of algorithms and existence proofs have been proposed, very little analysis is available for the properties of the paths generated and the computational resources required to generate them under a random distribution ...
متن کاملStabbing Delaunay Tetrahedralizations
A Delaunay tetrahedralization of n vertices is exhibited for which a straight line can pass through the interiors of Θ(n) tetrahedra. This solves an open problem of Nina Amenta, who asked whether a line can stab more than O(n) tetrahedra. The construction generalizes to higher dimensions: in d dimensions, a line can stab the interiors of Θ(ndd/2e) Delaunay d-simplices. The relationship between ...
متن کاملOn Deletion in Delaunay Triangulation
This paper present how space of spheres and shelling can be used to delete e ciently a point from d-dimensional triangulation. In 2-dimension, if k is the degree of the deleted vertex, the complexity is O(k log k), but we notice that this number apply only to low cost operations; time consuming computations are done only a linear number of times. This algorithm can be viewed as a variation of H...
متن کاملFiltering Relocations on a Delaunay Triangulation
Updating a Delaunay triangulation when its vertices move is a bottleneck in several domains of application. Rebuilding the whole triangulation from scratch is surprisingly a very viable option compared to relocating the vertices. This can be explained by several recent advances in efficient construction of Delaunay triangulations. However, when all points move with a small magnitude, or when on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2007
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2006.05.005